import java.util.Scanner;

public class J6_2_6 {
    //递归求斐波那契数列的第 N 项
    public static void main(String[] args) {
        System.out.println("请输入n");
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int num = fib(n);
        System.out.println("第n项为"+ num);
    }
    public static int fib(int n) {
        if (n == 1 || n == 2) {
            return 1;
        } else {
            return fib(n - 1) + fib(n - 2);
        }
    }
}
